Probabilistic path queries in road networks traffic uncertainty aware path selection.

Continuously monitoring top%2Dk uncertain data streams a probabilistic threshold method.

Continuous K%2DMeans Monitoring with Low Reporting Cost in Sensor Networks.

Top%2Dk typicality queries and efficient query answering methods on large databases.
typicality queries and efficient query answering methods on large databases
Efficiently Answering Probabilistic Threshold Top%2Dk Queries on Uncertain Data.
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (or as known as ranking queries) are often natural and useful in analyzing uncertain data in those applications. In this paper, we study the problem of answering probabilistic threshold top-k queries on uncertain data, which computes uncertain records taking a probability of at least p to be in the top-k list where p is a user specified probability threshold. We present an efficient exact algorithm and a fast sampling algorithm. An empirical study using real and synthetic data sets verifies the effectiveness of probabilistic threshold top-k queries and the efficiency of our methods. 1
DiMaC a disguised missing data cleaning tool.

DiMaC a system for cleaning disguised missing data.


Query answering techniques on uncertain and probabilistic data tutorial summary.
Uncertain data are inherent in some important applications, such as environmental surveillance, market analysis, and quantitative economics research. Due to the importance of those applications and the rapidly increasing amount of uncertain data collected and accumulated, analyzing large collections of uncertain data has become an important task and has attracted more and more interest from the database community. Recently, uncertain data management has become an emerging hot area in database research and development. In this tutorial, we systematically review some representative studies on answering various queries on uncertain and probabilistic data.

Cleaning disguised missing data a heuristic approach.

Efficiently Answering Top%2Dk Typicality Queries on Large Databases.
890 Finding typical instances is an effective approach to understand and analyze large data sets. In this paper, we apply the idea of typicality analysis from psychology and cognition science to database query answering, and study the novel problem of answering top-k typicality queries. We model typicality in large data sets systematically. To answer questions like “Who are the top-k most typical NBA players?”, the measure of simple typicality is developed. To answer questions like “Who are the top-k most typical guards distinguishing guards from other players?”, the notion of discriminative typicality is proposed. Computing the exact answer to a top-k typicality query requires quadratic time which is often too costly for online query answering on large databases. We develop a series of approximation methods for various situations. (1) The randomized tournament algorithm has linear complexity though it does not provide a theoretical guarantee on the quality of the answers. (2) The direct local typicality approximation using VP-trees provides an approximation quality guarantee. (3) A VP-tree can be exploited to index a large set of objects. Then, typicality queries can be answered efficiently with quality guarantees by a tournament method based on a Local Typicality Tree data structure. An extensive performance study using two real data sets and a series of synthetic data sets clearly show that top-k typicality queries are meaningful and our methods are practical.
FMC An Approach for Privacy Preserving OLAP.

